//
// Created by Administrator on 2024/3/26.
//
#include<bits/stdc++.h>

using namespace std;
int a[3];
double p[3] = {5.0, 3.0, 1.0 / 3};

void dfs(int k) {
    if (k >= 2) {
        a[2] = 100 - a[0] - a[1];
        if (a[2] % 3 == 0 and inner_product(a, a + 3, p, 0) == 100) {
            printf("cock=%d,hen=%d,chicken=%d\n", a[0], a[1], a[2]);

        }
        return;
    }
    for (int i = 0; i <= 100 - accumulate(a, a + k, 0); i++) {
        a[k] = i;
        dfs(k + 1);
    }
}

int main() {
    dfs(0);

    return 0;
}